منابع مشابه
Online and Random-order Load Balancing Simultaneously
We consider the problem of online load balancing under lp-norms: sequential jobs need to be assigned to one of the machines and the goal is to minimize the lp-norm of the machine loads. This generalizes the classical problem of scheduling for makespan minimization (case l∞) and has been thoroughly studied. However, despite the recent push for beyond worst-case analyses, no such results are know...
متن کاملSynchronizing automata with random inputs
We study the problem of synchronization of automata with random inputs. We present a series of automata such that the expected number of steps until synchronization is exponential in the number of states. At the same time, we show that the expected number of letters to synchronize any pair of the famous Černý automata is at most cubic in the number of states.
متن کاملRandom Dynamical Systems with Inputs
This work introduces a notion of random dynamical systems with inputs, providing several basic definitions and results on equilibria and convergence. It also presents a “converging input to converging state” (“CICS”) result, a concept that plays a key role in the analysis of stability of feedback interconnections, for monotone systems.
متن کاملBalancing Sums of Random Vectors
We study a higher-dimensional ‘balls-into-bins’ problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition these vectors into a fixed number of bins in such a way as to keep the sums of the vectors in the different bins close together; how close can we keep these sums almost surely? This question, our primary focus in this pap...
متن کاملOnline Balancing Two Independent Criteria
We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing their loads and required storage spaces. We first revisit the best existing solution for document placement, and rewrite it in our first algorithm by imposing some flexibil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2020
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20955